Box and Segment Intersection Graphs with Large Girth and Chromatic Number
نویسندگان
چکیده
We prove that there are intersection graphs of axis-aligned boxes in R3 and straight lines have arbitrarily large girth chromatic number.
منابع مشابه
Graphs With Large Girth And Large Chromatic Number
In the first part of these notes we use a probabilistic method to show the existence of graphs with large girth and large chromatic number. In the second part we give an explicit example of such graphs. It is mostly based on the third chapter of Some Applications Of Modular Forms by Peter Sarnak and also the third and forth chapters of Elementary Number Theory, Group Theory, And Ramanujan Graph...
متن کاملList edge chromatic number of graphs with large girth
Kostochka, A.V., List edge chromatic number of graphs with large girth, Discrete Mathematics 101 (1992) 189-201. It is shown that the list edge chromatic number of any graph with maximal degree A and girth at least 8A(ln A + 1.1) is equal to A + 1 or to A.
متن کاملGirth and Chromatic Number of Graphs
This paper will look at the relationship between high girth and high chromatic number in both its finite and transfinite incarnations. On the one hand, we will demonstrate that it is possible to construct graphs with high oddgirth and high chromatic number in all cases. We will then look at a theorem which tells us why, at least in the transfinite case, it is impossible to generalize this to in...
متن کاملTriangle-free geometric intersection graphs with large chromatic number
Several classical constructions illustrate the fact that the chromatic number of a graph may be arbitrarily large compared to its clique number. However, until very recently no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set X in R that is not an axis-aligned rectangle and for any pos...
متن کاملCircular Chromatic Number of Planar Graphs of Large Odd Girth
It was conjectured by Jaeger that 4k-edge connected graphs admit a (2k + 1, k)-flow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least 4k have circular chromatic number at most 2 + 1 k . Even this restricted version of Jaeger’s conjecture is largely open. The k = 1 case is the well-known Grötzsch 3-colour theorem. This paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in combinatorics
سال: 2021
ISSN: ['2517-5599']
DOI: https://doi.org/10.19086/aic.25431